New Two-Stage Automorphism Group Decoders for Cyclic Codes
نویسندگان
چکیده
منابع مشابه
New Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel
Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which...
متن کاملMemory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes
In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various...
متن کاملLow Complexity Two-Stage Soft/Hard Decoders
Next generation wireless systems will need higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having high flexibility and low complexity requirements at transmitter and receiver. In this paper, we point out some of the limit...
متن کاملNonlinear, Nonbinary Cyclic Group Codes
New cyclic group codes oflength 2"1 over (m j)-bit symbols are introduced. These codes can be systematically encoded and decoded algebraically. The code rates are very close to Reed-Solomon (RS) codes and are much better than BoseChaudhuri-Hocquenghem (BCH) codes (a former alternative). The binary (m j)tuples are identified with a subgroup of the binary m-tuples which represent the field GF(2m)...
متن کاملCombinatorial 3-manifolds with a cyclic automorphism group
In this article we substantially extend the classification of combinatorial 3-manifolds with cyclic automorphism group up to 22 vertices. Moreover, several combinatorial criteria are given to decide, whether a cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes together with a construction principle in the case that such a family exist. In addition, a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3022460